The Possible Winner Problem with Uncertain Weights1
نویسندگان
چکیده
The original possible winner problem is: Given an unweighted election with partial preferences and a distinguished candidate c, can the preferences be extended to total ones such that c wins? We introduce a novel variant of this problem in which not some of the voters’ preferences are uncertain but some of their weights. Not much has been known previously about the weighted possible winner problem. We present a general framework to study this problem, both for integer and rational weights, with and without upper bounds on the total weight to be distributed, and with and without ranges to choose the weights from. We study the complexity of these problems for important voting systems such as scoring rules, Copeland, ranked pairs, plurality with runoff, and (simplified) Bucklin and fallback voting.
منابع مشابه
The Possible Winner Problem with Uncertain Weights
The original possible winner problem is: Given an unweighted election with partial preferences and a distinguished candidate c, can the preferences be extended to total ones such that c wins? We introduce a novel variant of this problem in which not some of the voters’ preferences are uncertain but some of their weights. Not much has been known previously about the weighted possible winner prob...
متن کاملComputational complexity of two variants of the possible winner problem
A possible winner of an election is a candidate that has, in some kind of incomplete-information election, the possibility to win in a complete extension of the election. The first type of problem we study is the Possible co-Winner with respect to the Addition of New Candidates (PcWNA) problem, which asks, given an election with strict preferences over the candidates, is it possible to make a d...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملDeveloping Robust Project Scheduling Methods for Uncertain Parameters
A common problem arising in project management is the fact that the baseline schedule is often disrupted during the project execution because of uncertain parameters. As a result, project managers are often unable to meet the deadline time of the milestones. Robust project scheduling is an effective approach in case of uncertainty. Upon adopting this approach, schedules are protected against po...
متن کاملRobust optimization of a mathematical model to design a dynamic cell formation problem considering labor utilization
Cell formation (CF) problem is one of the most important decision problems in designing a cellular manufacturing system includes grouping machines into machine cells and parts into part families. Several factors should be considered in a cell formation problem. In this work, robust optimization of a mathematical model of a dynamic cell formation problem integrating CF, production planning and w...
متن کامل